Indices, Graphs and Null Models: Analyzing Bipartite Ecological Networks
نویسندگان
چکیده
منابع مشابه
Indices, Graphs and Null Models: Analyzing Bipartite Ecological Networks
Many analyses of ecological networks in recent years have introduced new indices to describe network properties. As a consequence, tens of indices are available to address similar questions, differing in specific detail, sensitivity in detecting the property in question, and robustness with respect to network size and sampling intensity. Furthermore, some indices merely reflect the number of sp...
متن کاملBipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have been made to provide accurate models. We study here the first model which achieves the following challenges: it produces graphs which have the three main wanted properties (clustering, degree distribution, average dist...
متن کاملThe IC-Indices of Complete Bipartite Graphs
Let G be a connected graph, and let f be a function mapping V (G) into N. We define f(H) = ∑ v∈V (H) f(v) for each subgraph H of G. The function f is called an IC-coloring of G if for each integer k in the set {1, 2, · · · , f(G)} there exists an (induced) connected subgraph H of G such that f(H) = k, and the IC-index of G, M(G), is the maximum value of f(G) where f is an IC-coloring of G. In t...
متن کاملextreme edge-friendly indices of complete bipartite graphs
let g=(v,e) be a simple graph. an edge labeling f:e to {0,1} induces a vertex labeling f^+:v to z_2 defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where z_2={0,1} is the additive group of order 2. for $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. a labeling f is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. i_f(g)=v_f(1)-v_f(0) is called the edge-f...
متن کاملBayesian nonparametric models for bipartite graphs
We develop a novel Bayesian nonparametric model for random bipartite graphs. The model is based on the theory of completely random measures and is able to handle a potentially infinite number of nodes. We show that the model has appealing properties and in particular it may exhibit a power-law behavior. We derive a posterior characterization, a generative process for network growth, and a simpl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Ecology Journal
سال: 2009
ISSN: 1874-2130
DOI: 10.2174/1874213000902010007